Automated Theorem Proving: an Overview
نویسندگان
چکیده
Automated Theorem Provers are computer programs written to prove, or help in proving, mathematical and non-mathematical theorems. Automated Theorem Proving (ATP) is a rapidly advancing field and contains many potential research areas. This paper is an overview of this important field. It starts by giving the needed mathematical background followed by an overview. The overview includes historical background, basic terminology and notations and a description of the major components of a typical theorem prover. The paper also outlines the current state of research in ATP and a brief description of some of the existing theorem provers. * Address for correspondence: KFUPM Box 806 King Fahd University of Petroleum & Minerals Dhahran 31261 Saudi Arabia 245 The Arabian Journalfor Science and Engineering. Volume 22. Number 2B. October 1997
منابع مشابه
Computer Theorem Proving in Math
We give an overview of issues surrounding computerverified theorem proving in the standard pure-mathematical context.
متن کاملAutomated Reasoning for Mizar: Artificial Intelligence through Knowledge Exchange
This paper gives an overview of the existing link between the Mizar project for formalization of mathematics and Automated Reasoning tools (mainly the Automated Theorem Provers (ATPs)). It explains the motivation for this work, gives an overview of the translation method, discusses the projects and works that are based on it, and possible future projects and directions.
متن کاملAutomated Theorem Proving: Underlying Theory, Overarching Concepts, and Human Factor Issues
In this memo, we discuss the topic of automated theorem proving. This note is intended to serve as an introduction for someone interested in the topic but who doesn’t have extensive background in formal proof systems. The topics covered in this memo are kept at a somewhat conceptual level and pointers are provided to appropriate references for more in-depth treatment of specific topics. In the ...
متن کاملAlgorithms, Datastructures, and other Issues in Efficient Automated Deduction
Algorithms and datastructures form the kernel of any efficient theorem prover. In this abstract we discuss research on algorithms and datastructures for efficient theorem proving based on our experience with the theorem prover Vampire. We also briefly overview other works related to algorithms and datastructures, and to efficient theorem proving in general.
متن کاملTheorem Proving for Verification
The challenges in using theorem proving for verification of parallel systems are to achieve adequate automation, and to allow human guidance to be expressed in terms of the system under examination rather than the mechanisms of the prover. This paper provides an overview of techniques that address these challenges.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1997